Decomposing a Matrix into Two Submatrices with Extremely Small Operator Norm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix rounding with respect to small submatrices

We show that any real valued matrix A can be rounded to an integer one B such that the error in all 2× 2 (geometric) submatrices is less than 1.5, that is, we have |aij − bij | < 1 and | ∑i+1 k=i ∑j+1 `=j (ak`− bk`)| < 1.5 for all i, j.

متن کامل

Operator-valued extensions of matrix-norm inequalities

The bilinear inequality is derived from the linear one with the help of an operatorvalued version of the Cauchy-Schwarz inequality. All these results, at least in their finite form, are obtained by simple and elegant methods well within the scope of a basic course on Hilbert spaces. (They can alternatively be obtained by tensor product techniques, but in the author’s view, these methods are les...

متن کامل

Off-diagonal Submatrices of a Hermitian Matrix

A necessary and sufficient condition is given to a p × q complex matrix X to be an off-diagonal block of an n × n Hermitian matrix C with prescribed eigenvalues (in terms of the eigenvalues of C and singular values of X). The proof depends on some recent breakthroughs in the study of spectral inequalities on the sum of Hermitian matrices by Klyachko and Fulton. Some interesting geometrical prop...

متن کامل

Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm

We propose a convex optimization formulation with the nuclear norm and `1-norm to find a large approximately rank-one submatrix of a given nonnegative matrix. We develop optimality conditions for the formulation and characterize the properties of the optimal solutions. We establish conditions under which the optimal solution of the convex formulation has a specific sparse structure. Finally, we...

متن کامل

Decomposing highly edge-connected graphs into trees of small diameter

The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Notes

سال: 2020

ISSN: 0001-4346,1573-8876

DOI: 10.1134/s0001434620070135